The norm of minimal polynomials on several intervals

نویسنده

  • Vilmos Totik
چکیده

Using works of Franz Peherstorfer, we examine how close the nth Chebyshev number for a set E of finitely many intervals can get to the theoretical lower limit 2cap(E)n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An equivalent representation for weighted supremum norm on the upper half-plane

In this paper, rstly, we obtain some inequalities which estimates complex polynomials on the circles.Then, we use these estimates and a Moebius transformation to obtain the dual of this estimates forthe lines in upper half-plane. Finally, for an increasing weight on the upper half-plane withcertain properties and holomorphic functions f on the upper half-plane we obtain an equivalentrepresenta...

متن کامل

The integer Chebyshev problem

We are concerned with the problem of minimizing the supremum norm on an interval of a nonzero polynomial of degree at most n with integer coefficients. This is an old and hard problem that cannot be exactly solved in any nontrivial cases. We examine the case of the interval [0, 1] in most detail. Here we improve the known bounds a small but interesting amount. This allows us to garner further i...

متن کامل

A note on some extremal problems for trigonometric polynomials

We consider the problem of finding the trigonometric polynomial θ0 + m ∑ j=1 θ2j−1 sin(jx) + θ2j cos(jx) with minimal sup-norm on the interval [−π, π], where one coefficient in the polynomial, say θk (0 ≤ k ≤ 2m), has been fixed. A complete solution of this problem is given, which depends sensitively on the ratio k/m, and the problem of uniqueness is discussed. Several examples are presented to...

متن کامل

On Chebyshev Polynomials of Matrices

The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is uniquely defined if m is less than the degree of the minimal polynomial of A. We study general properties of Chebyshev polynomials of matrices, which in some cases turn out to be generalizations of well known propertie...

متن کامل

Products of Polynomials in Uniform Norms

We study inequalities connecting a product of uniform norms of polynomials with the norm of their product. This subject includes the well known Gel’fond-Mahler inequalities for the unit disk and Kneser inequality for the segment [−1, 1]. Using tools of complex analysis and potential theory, we prove a sharp inequality for norms of products of algebraic polynomials over an arbitrary compact set ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Approximation Theory

دوره 163  شماره 

صفحات  -

تاریخ انتشار 2011